منابع مشابه
Counting with rational generating functions
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input variables of the (quasi-polynomial) function are fixed, there is a polynomial time algorithm which converts between the two representations. Examples of such countin...
متن کاملCounting Real Rational Functions with All Real Critical Values
We study the number ♯ n of real rational degree n functions (considered up to a linear fractional transformation of the independent variable) with a given set of 2n − 2 distinct real critical values. We present a combinatorial interpretation of these numbers and pose a number of related questions.
متن کاملCounting Curves on Rational Surfaces
In [CH3], Caporaso and Harris derive recursive formulas counting nodal plane curves of degree d and geometric genus g in the plane (through the appropriate number of fixed general points). We rephrase their arguments in the language of maps, and extend them to other rational surfaces, and other specified intersections with a divisor. As applications, (i) we count irreducible curves on Hirzebruc...
متن کاملRational Functions with Linear Relations
We find all polynomials f, g, h over a field K such that g and h are linear and f(g(x)) = h(f(x)). We also solve the same problem for rational functions f, g, h, in case the field K is algebraically closed.
متن کاملCounting Rational Points on Hypersurfaces
For any n ≥ 2, let F ∈ Z[x1, . . . , xn] be a form of degree d ≥ 2, which produces a geometrically irreducible hypersurface in P. This paper is concerned with the number N(F ; B) of rational points on F = 0 which have height at most B. For any ε > 0 we establish the estimate N(F ; B) = O(B), whenever either n ≤ 5 or the hypersurface is not a union of lines. Here the implied constant depends at ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90020-5